Maximal induced colorable subhypergraphs of all uncolorable BSTS (15)'s
نویسنده
چکیده
A Bi-Steiner Triple System (BSTS) is a Steiner Triple System with vertices colored in such a way that the vertices of each block receive precisely two colors. When we consider all BSTS(15)s as mixed hypergraphs, we find that some are colorable while others are uncolorable. The criterion for colorability for a BSTS(15) by Rosa is containing BSTS(7) as a subsysytem. Of the 80 nonisomorphic BSTS(15)s, only 23 meet this criterion and are therefore colorable. The other 57 are uncolorable. The question arose of finding maximal induced colorable subhypergraphs of these 57 uncolorable BSTS(15)s. This paper gives feasible partitions of maximal induced colorable subhypergraphs of each uncolorable BSTS(15).
منابع مشابه
All proper colorings of every colorable BSTS(15)
A Steiner System, denoted S(t, k, v), is a vertex set X containing v vertices, and a collection of subsets of X of size k, called blocks, such that every t vertices from X are in exactly one of the blocks. A Steiner Triple System, or STS, is a special case of a Steiner System where t = 2, k = 3 and v = 1 or 3 (mod6) [7]. A Bi-Steiner Triple System, or BSTS, is a Steiner Triple System with the v...
متن کاملUncolorable Mixed Hypergraphs
A mixed hypergraph H = (X; A; E) consists of the vertex set X and two families of subsets: the family E of edges and the family A of co-edges. In a coloring every edge E 2 E has at least two vertices of diierent colors, while every co-edge A 2 A has at least two vertices of the same color. The largest (smallest) number of colors for which there exists a coloring of a mixed hypergraph H using al...
متن کاملMixed Interval Hypergraphs
We investigate the coloring properties of mixed interval hypergraphs having two families of subsets: the edges and the co-edges. In every edge at least two vertices have different colors. The notion of a co-edge was introduced recently in [2,3]: in every such a subset at least two vertices have the same color. The upper (lower) chromatic number is defined as a maximum (minimum) number of colors...
متن کاملThe first BSTS with different upper and lower chromatic numbers
In this paper the first BSTS in which the upper chromatic number is different from the lower chromatic number is determined. It is a BSTS(19) and its order is the lowest for which this property holds. In addition, all the possible strict colourings and their upper and lower chromatic number for systems of triples of the type BSTS(15), BSTS(19) and BSTS(21) are also determined.
متن کاملUniquely colorable mixed hypergraphs
A mixed hypergraph consists of two families of edges: the C-edges and D-edges. In a coloring every C-edge has at least two vertices of the same color, while every D-edge has at least two vertices colored differently. The largest and smallest possible numbers of colors in a coloring are termed the upper and lower chromatic number, χ̄ and χ, respectively. A mixed hypergraph is called uniquely colo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- The Computer Science Journal of Moldova
دوره 19 شماره
صفحات -
تاریخ انتشار 2011